Symbolic Summation Finds Optimal Nested Sum Representations
نویسنده
چکیده
We consider the following problem: Given a nested sum expression, find a sum representation such that the nested depth is minimal. We obtain symbolic summation algorithms that solve this problem for sums defined, e.g., over hypergeometric, q-hypergeometric or mixed hypergeometric expressions.
منابع مشابه
A Symbolic Summation Approach to Find Optimal Nested Sum Representations
We consider the following problem: Given a nested sum expression, find a sum representation such that the nested depth is minimal. We obtain a symbolic summation framework that solves this problem for sums defined, e.g., over hypergeometric, q-hypergeometric or mixed hypergeometric expressions. Recently, our methods have found applications in quantum field theory.
متن کاملA Refined Difference Field Theory for Symbolic Summation
In this article we present a refined summation theory based on Karr’s difference field approach. The resulting algorithms find sum representations with optimal nested depth. For instance, the algorithms have been applied successively to evaluate Feynman integrals from Perturbative Quantum Field Theory.
متن کاملSimplifying Sums in Πς ∗ - Extensions Carsten
We present telescoping algorithms which compute optimal sum representations of indefinite nested sums. More precisely, given a rational summand expression in terms of nested sums and products, the algorithm splits the summand into a summable part, which can be summed by telescoping, and into a non-summable part, which is degree-optimal with respect to one of the most nested sums or products. If...
متن کاملCalculating Three Loop Ladder and V-Topologies for Massive Operator Matrix Elements by Computer Algebra
Three loop ladder and V-topology diagrams contributing to the massive operator matrix element AQg are calculated. The corresponding objects can all be expressed in terms of nested sums and recurrences depending on the Mellin variable N and the dimensional parameter ε. Given these representations, the desired Laurent series expansions in ε can be obtained with the help of our computer algebra to...
متن کاملA Symbolic Summation Approach to Feynman Integral Calculus
Given a Feynman parameter integral, depending on a single discrete variable N and a real parameter ε, we discuss a new algorithmic framework to compute the first coefficients of its Laurent series expansion in ε. In a first step, the integrals are expressed by hypergeometric multisums by means of symbolic transformations. Given this sum format, we develop new summation tools to extract the firs...
متن کامل